- maximum(-length) string
- последовательность максимальной длины, максимальная последовательность
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
maximum(-length) string
Смотреть что такое "maximum(-length) string" в других словарях:
String (computer science) — In formal languages, which are used in mathematical logic and theoretical computer science, a string is a finite sequence of symbols that are chosen from a set or alphabet. In computer programming, a string is traditionally a sequence of… … Wikipedia
String duality — is a class of symmetries in physics that link different string theories, theories which assume that the fundamental building blocks of the universe are strings instead of point particles. Before the so called duality revolution there were… … Wikipedia
String trimmer — Weedeater redirects here, for the band see Weedeater (band) A string trimmer, also called a line trimmer, Weedeater (a brandname), Weedwhacker(a brandname) or weed wacker, Weed Whip, weedy, whipper snipper, garden strimmer or Trimmer is a powered … Wikipedia
Run length limited — or RLL coding is a technique that is used to store data on recordable media. Specifically, RLL prevents long stretches of repeated bits from causing the signal recorded on media to not change for an excessive period, by modulating the data. RLL… … Wikipedia
printf format string — An example of the printf function. Printf format string (which stands for print formatted ) refers to a control parameter used by a class of functions typically associated with some types of programming languages. The format string specifies a… … Wikipedia
Orders of magnitude (length) — Contents 1 Detailed list 1.1 Subatomic 1.2 Atomic to cellular 1.3 Human scale 1.4 … Wikipedia
Closest string — In theoretical computer science, closest string is the name of an NP hard computational problem, which tries to find the geometrical center of a set of input strings. To understand the word center it is necessary to define a distance between two… … Wikipedia
Minimum description length — The minimum description length (MDL) principle is a formalization of Occam s Razor in which the best hypothesis for a given set of data is the one that leads to the best compression of the data. MDL was introduced by Jorma Rissanen in 1978. It is … Wikipedia
Comparison of Object Pascal and C — Programming language comparisons General comparison Basic syntax Basic instructions Arrays Associative arrays String operations … Wikipedia
India — /in dee euh/, n. 1. Hindi, Bharat. a republic in S Asia: a union comprising 25 states and 7 union territories; formerly a British colony; gained independence Aug. 15, 1947; became a republic within the Commonwealth of Nations Jan. 26, 1950.… … Universalium
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
